Min-Max Differential Dynamic Programming: Continuous and Discrete Time Formulations
نویسندگان
چکیده
منابع مشابه
Dynamic Min-Max Problems
A linear-system-theoretic view of discrete-event processes and its use for performance evaluation in manufacturing. 20 2. G t is a dominating subgraph of G c as there are no edges between nodes v i 2 V ? t and v j 2 (V + nV + t), G t has a min-max potential and G c has a min potential. G t is a maximal dominating subgraph of G c. To proof this, let us suppose that a subgraph G q of G c nG t cou...
متن کاملMin - Max Control with Application to Discrete Event Dynamic Systems
Large classes of dynamic phenomena such as material flow in manufacturing systems, traffic flow in transportation or communication networks, and related scheduling problems can be viewed as discrete event dynamical systems (DEDS); see the papers in [7] for surveys. An efficient approach [3,9] to model large classes of DEDS has been based on the minimax algebra [4] and describes the time dynamic...
متن کاملMin-max control of constrained uncertain discrete-time linear systems
For discrete-time uncertain linear systems with constraints on inputs and states, we develop an approach to determine state feedback controllers based on a min-max control formulation. Robustness is achieved against additive norm-bounded input disturbances and/or polyhedral parametric uncertainties in the state-space matrices. We show that the finite-horizon robust optimal control law is a cont...
متن کاملMax–Min Optimal Control of Constrained Discrete-time Systems
This paper considers the optimal control problem for constrained discrete–time systems affected by measured and bounded disturbances and uncertainties in the underlying system equations. This problem setting leads to the sup–inf robust optimal control problems. Three classes of discrete–time systems permitting the characterization of the sup–inf value functions and robust optimal control polici...
متن کاملMin-max-min Robust Combinatorial Optimization Subject to Discrete Uncertainty
We consider combinatorial optimization problems with uncertain objective functions. In the min-max-min robust optimization approach, a fixed number k of feasible solutions is computed such that the respective best of them is optimal in the worst case. The idea is to calculate a set of candidate solutions in a potentially expensive preprocessing and then select the best solution out of this set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Guidance, Control, and Dynamics
سال: 2018
ISSN: 0731-5090,1533-3884
DOI: 10.2514/1.g003516